A Space - Time Tradeo for A *
نویسنده
چکیده
A memory-based heuristic is a function, h(s), stored in the form of a lookup table (pattern database): h(s) is computed by mapping s to an index and then retrieving the appropriate entry in the table. (Korf 1997) conjectures that for A* search using memory-based heuristics m t is a constant, where m is the size of the heuristic's lookup table and t is search time. In this paper we present a method for automatically generating memory-based heuristics and use this to test Korf's conjecture in a large-scale experiment. The results strongly support Korf's conjecture.
منابع مشابه
Time-Space Tradeo s for Undirected Graph Traversal by Graph Automata
We investigate time-space tradeo s for traversing undirected graphs, using a variety of structured models that are all variants of Cook and Racko 's \Jumping Automata for Graphs". Our strongest tradeo is a quadratic lower bound on the product of time and space for graph traversal. For example, achieving linear time requires linear space, implying that depthrst search is optimal. Since our bound...
متن کاملTopological Parameters for time-space tradeo
In this paper we propose a family of algorithms combining tree-clustering with conditioning that trade space for time. Such algorithms are useful for reasoning in probabilistic and deterministic networks as well as for accomplishing optimization tasks. By analyzing the problem structure it will be possible to select from a spectrum the algorithm that best meets a given time-space speci cation.
متن کاملTime - Space Tradeo s for Undirected Graph Traversal
We prove time-space tradeo s for traversing undirected graphs, using a variety of structured models that are all variants of Cook and Racko 's \Jumping Automata for Graphs". Our strongest tradeo is a quadratic lower bound on the product of time and space for graph traversal. For example, achieving linear time requires linear space, implying that depthrst search is optimal. Since our bound in fa...
متن کاملA Time-Space Tradeo for Undirected Graph Traversal by Walking Automata
We prove a time-space tradeo for traversing undirected graphs, using a structured model that is a nonjumping variant of Cook and Racko 's \Jumping Automata for Graphs". This material is based upon work supported in part by the Natural Sciences and Engineering Research Council of Canada, by the National Science Foundation under Grants CCR-8703196, CCR-8858799, CCR-8907960, and CCR9002891, and by...
متن کاملApplication of Single-Frequency Time-Space Filtering Technique for Seismic Ground Roll and Random Noise Attenuation
Time-frequency filtering is an acceptable technique for attenuating noise in 2-D (time-space) and 3-D (time-space-space) reflection seismic data. The common approach for this purpose is transforming each seismic signal from 1-D time domain to a 2-D time-frequency domain and then denoising the signal by a designed filter and finally transforming back the filtered signal to original time domain. ...
متن کاملAn Evolutionary Approach to Hardware/ Software Partitioning
In this paper, we present an approach to hardware/software codesign of real-time embedded systems. Two of the di culties associated with codesign are handling tradeo s among multiple attributes and exploring a large design space. We use a combination of techniques from the evolutionary computation and utility theory elds to address these problem areas. A real-time microcontroller-based design e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007